Search results for "Boolean algebras canonically defined"
showing 4 items of 4 documents
The overlap algebra of regular opens
2010
Abstract Overlap algebras are complete lattices enriched with an extra primitive relation, called “overlap”. The new notion of overlap relation satisfies a set of axioms intended to capture, in a positive way, the properties which hold for two elements with non-zero infimum. For each set, its powerset is an example of overlap algebra where two subsets overlap each other when their intersection is inhabited. Moreover, atomic overlap algebras are naturally isomorphic to the powerset of the set of their atoms. Overlap algebras can be seen as particular open (or overt) locales and, from a classical point of view, they essentially coincide with complete Boolean algebras. Contrary to the latter, …
On Rough Sets in Topological Boolean Algebras
1994
We have focused on rough sets in topological Boolean algebras. Our main ideas on rough sets are taken from concepts of Pawlak [4] and certain generalizations of his constructions which were offered by Wiweger [7]. One of the most important results of this note is a characterization of the rough sets determined by regular open and regular closed elements.
Conditioning on MV-algebras and additive measures —I
1997
Abstract We present a lattice-ordered semigroup approach for the foundation of conditional events which covers the special situations where the underlying (unconditional) events are Boolean or fuzzy, respectively. Our proposal is quite different from other, ring theoretical, approaches. The problem of extending additivity of uncertainty measures from unconditional to conditional events will be discussed.
Exact quantum algorithms have advantage for almost all Boolean functions
2014
It has been proved that almost all $n$-bit Boolean functions have exact classical query complexity $n$. However, the situation seemed to be very different when we deal with exact quantum query complexity. In this paper, we prove that almost all $n$-bit Boolean functions can be computed by an exact quantum algorithm with less than $n$ queries. More exactly, we prove that ${AND}_n$ is the only $n$-bit Boolean function, up to isomorphism, that requires $n$ queries.